Categorial grammars used to partial parsing of spoken language
نویسندگان
چکیده
Spoken language understanding is a challenge for the development of Spoken Dialogue Systems. Recognition errors and speech repairs make it impossible to get complete syntactic analysis. Shallow parsing and chunking seem to be efficient in order to start both a robust and precise analysis. This paper describes experiments made with Logus, a spoken understanding system based on incremental methology. It presents the first step of the parsing, a chunking based on rules of categorial grammars and pregroups. These formalisms are very appropriate for this treatment and we argue they could be more widely used for applications of this type.
منابع مشابه
A Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalisms like Lambek calculus but have a polynomial parsing algorithm. The paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approch based on majority partial composition.
متن کاملPPQ : a pregroup parser using majority composition
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup grammar that uses a tabular approach based on majority partial composition.
متن کاملUsing the Spoken Dutch Corpus for type-logical grammar induction
Abstract The dependency-based annotation format employed within the Spoken Dutch Corpus (CGN) project (van der Wouden et al., 2002) has been designed in such a way as to enable a transparent mapping to the derivational structures of current ‘lexicalized’ grammar formalisms. Through such translations, the CGN tree bank can be used to train and evaluate computational grammars within these framewo...
متن کاملParsing Pregroup Grammars and Lambek Calculus Using Partial Composition
The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises.
متن کاملS4 enriched multimodal categorial grammars are context-free
Bar-Hillel et al. [1] prove that applicative categorial grammars weakly recognize the context-free languages. Buszkowski [2] proves that grammars based on the product-free fragment of the non-associative Lambek calculus NL recognize exactly the contextfree languages. Kandulski [7] furthers this result by proving that grammars based on NL also recognize exactly the context-free languages. Jäger ...
متن کامل